Task Clustering and Scheduling to Multiprocessors with Duplication
نویسندگان
چکیده
Optimul tusk-duplication-based scheduling of tusks represented by u directed ucyclic gruph (DAG) onto u set of homogenous distributed memory processors, is a strong NP-hard problem. In this puper we present a clustering und scheduling ulgorifhm with time complexity O(v310gv), where v is the number of nodes, which is able to generate optimal schedule for some specljk DAGs. For urhifrury DAGs, the schedule generated is at most two times as the optimul one. Simulution results show that Ihe performunce of TCSD is superb to those of four renowned algorithms: PX TDS, TCS und CPFD.
منابع مشابه
Green Energy-aware task scheduling using the DVFS technique in Cloud Computing
Nowdays, energy consumption as a critical issue in distributed computing systems with high performance has become so green computing tries to energy consumption, carbon footprint and CO2 emissions in high performance computing systems (HPCs) such as clusters, Grid and Cloud that a large number of parallel. Reducing energy consumption for high end computing can bring various benefits such as red...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملS3MP: A Task Duplication Based Scalable Scheduling Algorithm for Symmetric Multiprocessors
We present a task duplication based scalable scheduling algorithm for Symmetric Multiprocessors (SMP), called S3MP (Scalable Scheduling for SMP), to address the problem of task scheduling. The algorithm pre-allocates network communication resources so as to avoid potential communication conflicts, and generates a schedule for the number of processors available in a SMP. This algorithm employs h...
متن کاملAn Efficient Task Clustering Heuristic for Scheduling DAGs on Multiprocessors
For task clustering with no duplication, the DSC algorithm of Gerasoulis and Yang is empirically the best known algorithm to date in terms of both speed and solution quality. The DSC algorithm is based on the critical path method. In this paper, we present an algorithm called CASS-II for task clustering with no duplication which is competitive to DSC in terms of both speed and solution quality....
متن کامل